Run Once, Write Anyway
نویسنده
چکیده
Scheme is one of only a few languages with a concise specification and formal semantics. With such a foundation it should be easy to write portable code that, without modification, runs correctly on different Scheme implementations. Yet this goal has proved elusive – there are more than fifty Schemes and writing programs that are portable between even just a few of these implementations is tedious at best and impossible at worst. We examine the reasons behind the Scheme community’s failure to provide developers with a basis for writing portable code. We look at the various Scheme standardisation efforts and identify their contributions and shortcomings. Finally we present a series of recommendations for resolving the key portability issues. Our proposals include a minor revision of the Scheme standard, specifically aimed at improving portability, the creation of a standard library, and a central code repository and package management system.
منابع مشابه
Number : Title : Concurrent use of write - once memory
We consider the problem of implementing general shared-memory
متن کاملDetecting Earth’s Temporarily Captured Natural Irregular Satellites
JEDICKE WILL WRITE ONCE REMAINDER OF PAPER IS COMPLETE. Subject headings: Near-Earth Objects; Asteroids, Dynamics
متن کاملTowards compliant data retention with probe storage on patterned media
We describe how the compliance requirements for data retention from recent laws such as the US Sarbanes Oxley Act may be supported by a tamper-evident secure storage system based on probe storage with a patterned magnetic medium. This medium supports normal read/write operations by out-of-plane magnetisation of individual dots. We report on an experiment to show that in principle the medium als...
متن کاملOn multiply-exponential write-once Turing machines
In this work we analyze the multiply-exponential complexity classes for writeonce Turing machines, i.e. machines that can write to a given tape cell at most once. We show that k–DExpWOSpace = k–DExpWOTime = k–ExpTime and the nondeterministic counterpart. For alternating machines we show that k–AExpWOTime = k–AExpTime = k-1–ExpSpace.
متن کاملJava in Ubicomp
This paper describes the use of Java language in embedded devices, such as handhelds, digital TV set-top boxes, and even smart cards. The variety of devices offering the Java platform has transformed the original Java mantra “write once, run anywhere” into “one size doesn’t fit all”.
متن کامل